|
Raimund G. Seidel is a German and Austrian theoretical computer scientist and an expert in computational geometry. Seidel was born in Graz, Austria, and studied with Hermann Maurer at the Graz University of Technology.〔(Profile ) in program for conference on significant advances in computer science, Graz University of Technology, 2007.〕 He received his Ph.D. in 1987 from Cornell University under the supervision of John Gilbert.〔.〕 After teaching at the University of California, Berkeley, he moved in 1994 to Saarland University.〔(Profile ) at the Multimodal Computing and Interaction cluster, Saarland University.〕 In 1997 he and Christoph M. Hoffmann were program chairs for the Symposium on Computational Geometry. In 2014, he became director of the Leibniz Center for Informatics at Schloss Dagstuhl.〔.〕 Seidel invented backwards analysis of randomized algorithms and used it to analyze a simple linear programming algorithm that runs in linear time for problems of bounded dimension.〔.〕 With his student Cecilia R. Aragon in 1989 he devised the treap data structure,〔 〕〔 .〕 and he is also known for the Kirkpatrick–Seidel algorithm for computing two-dimensional convex hulls. ==References== 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Raimund Seidel」の詳細全文を読む スポンサード リンク
|